Equilibria in multi-player multi-outcome infinite sequential games
نویسندگان
چکیده
We investigate the existence of certain types of equilibria (Nash, ε-Nash, subgame perfect, ε-subgame perfect, Pareto-optimal) in multi-player multi-outcome infinite sequential games. We use two fundamental approaches: one requires strong topological restrictions on the games, but produces very strong existence results. The other merely requires some very basic determinacy properties to still obtain some existence results. Both results are transfer results: starting with the existence of some equilibria for a small class of games, they allow us to conclude the existence of some type of equilibria for a larger class. To make the abstract results more concrete, we investigate as a special case infinite sequential games with real-valued payoff functions. Depending on the class of payoff functions (continuous, upper semi-continuous, Borel) and whether the game is zero-sum, we obtain various existence results for equilibria. Our results hold for games with two or up to countably many players.
منابع مشابه
Nash Equilibria for Reachability Objectives in Multi-player Timed Games
We propose a procedure for computing Nash equilibria in multi-player timed games with reachability objectives. Our procedure is based on the construction of a finite concurrent game, and on a generic characterization of Nash equilibria in (possibly infinite) concurrent games. Along the way, we use our characterization to compute Nash equilibria in finite concurrent games.
متن کاملCorrelated Equilibria in Multi-Player Games
This paper gives a constructive proof for the existence of correlated equilibria in multi-player games and shows how elements of the proof can be used for the computation of correlated equilibria in polynomial time for an important subset of succinct games. None of this work is novel, it merely aims at a more detailed and approachable description of the proof in Papadimitriou’s journal article ...
متن کاملExpressiveness and Complexity Results for Strategic Reasoning
Abstract This paper presents a range of expressiveness and complexity results for the specification, computation, and verification of Nash equilibria in multi-player non-zero-sum concurrent games in which players have goals expressed as temporal logic formulae. Our results are based on a novel approach to the characterisation of equilibria in such games: a semantic characterisation based on win...
متن کاملA Foundation for Markov Equilibria in Sequential Games with Finite Social Memory*
We study stochastic games with an infinite horizon and sequential moves played by an arbitrary number of players. We assume that social memory is finite—every player, except possibly one, is finitely lived and cannot observe events that are sufficiently far back in the past. This class of games includes games between a long-run player and a sequence of short-run players, and games with overlapp...
متن کاملThe benefit of law-making power
We study optimal equilibria in multi-player games. An equilibrium is optimal for a player, if her payoff is maximal. A tempting approach to solving this problem is to seek optimal Nash equilibria, the standard form of equilibria where no player has an incentive to deviate from her strategy. We argue that a player with the power to define an equilibrium is in a position, where she should not be ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2014